New Dire tions in Design of Resilient Boolean Fun tions

Äääöòòòò Ùò Blockinøøóò× Óó Ööððúòø Úööööðð×

We onsider a fundamental problem in omputational learning theory: learning an arbitrary Boolean fun tion that depends on an unknown set of k out of n Boolean variables. We give an algorithm for learning su h fun tions from uniform random examples that runs in time roughly (n k ) ! !+1 ; where ! < 2:376 is the matrix multipli ation exponent. We thus obtain the rst polynomial fa tor improvement o...

Exposure-Resilient Fun tions and All-Or-Nothing Transforms

Hardware/Software Co-Design Using Functional Languages

In previous work we have developed and prototyped a silion ompiler whi h translates a fun tional language (SAFL) into hardware. The te hniques we use require the restri tion (stati allo atability) that all re ursive alls are in a tail ontext. Here we extend this work, translating a fun tional language with general re ursion by mapping some fun tions dire tly to hardware and others to instru tio...

Correlation Immune Boolean Fun tions with Very

On the bent boolean fun tions whi h are symmetri